On multiplying large periodic integers. II

More On Squaring and Multiplying Large Integers

t = vzge(b,w,a)

A quantum architecture for multiplying signed integers

Multiplying huge integers using Fourier transforms

Multiplying huge integers of n digits can be done in time O(n log(n)) using Fast Fourier Transforms (FFT), instead of the O(n) time complexity normally required. In this paper we present this technique from the viewpoint of polynomial multiplication, explaining a recursive divide-and-conquer approach to FFT multiplication. We have compared both methods of multiplication quantitatively and prese...

Periodic Sets of Integers

On products of integers. II

1. Throughout this paper, c 1 , c2 , . . . denote absolute constants ; ko (a, fl, . . .), kr (a, f3, . . .), . . ., xo (a, /3, . . .), . . . denote constants depending only on the parameters a, /l, . . . ; v(n) denotes the number of the prime factors of the positive integer n, counted according to their multiplicity . The number of the elements of a finite set S is denoted by I S I . Let k, n b...